Invariants of Graphs in Three-Space

نویسندگان

  • Louis H. Kauffman
  • LOUIS H. KAUFFMAN
  • Pierre Vogel
چکیده

By associating a collection of knots and links to a graph in threedimensional space, we obtain computable invariants of the embedding type of the graph. Two types of isotopy are considered: topological and rigid-vertex isotopy. Rigid-vertex graphs are a category mixing topological flexibility with mechanical rigidity. Both categories constitute steps toward models for chemical and biological networks. We discuss chirality in both rigid and topological contexts. This paper introduces methods for producing topological invariants of graphs embedded in three-dimensional space. For this study, two types of graphs are considered: graphs with rigid vertices and graphs with nonrigid vertices. Our methods are strongest for graphs with rigid vertices. The primary method in either case is to associate a collection of knots and links to thegraph such that, for the appropriate notion of isotopy, this collection (the isotopy class of the collection) is an invariant of the isotopy type of the graph. One may proceed purely geometrically, or apply knot theoretic invariants to the collection. This method is simple and powerful. By not opting too early for the extra structure of a polynomial invariant, we can often directly use the topology to create a minimal solution. Nevertheless, it turns out to be particularly fruitful to use the new polynomial invariants of Jones and others (see [3, 5, 6, 7, 9, 10, 131). Also, by combining knot theoretic invariants, we [lo] have produced nontrivial graph-polynomial invariants in the case of 4-valent rigid vertex graphs. The latter invariants generalize the known two-variable polynomial invariants of knots and links (Homfly and Kauffman polynomials). These generalizations are joint work of the author and Pierre Vogel [lo]. I shall show here ($4) how these polynomials are related to the point of view involving a collection of links associated with the graph. The paper is organized as follows: In $2 we define ambient isotopy for nonrigid (topological) vertices and prove that piecewise linear ambient isotopy is generated diagrammatically by a set of moves (Figure 1) that generalize the Reidemeister moves). $2 then shows Received by the editors December 1, 1987. 1980 Mathematics Subject Classification (1985 Revision). Primary 57M25. @ 1989 Amencan Mathemat~cal Soclely 0002.9947189 $ l 00 + $ 2 5 per page

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

Product version of reciprocal degree distance of composite graphs

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.

متن کامل

The 3-move and Knotted 4-valent Graphs in 3-space

A topological graph is a one-dimensional complex consisting of finitely many 0-cells (vertices) and finitely many 1-cells (edges and loops). In [7], Kauffman proved that piecewise linear ambient isotopy of a piecewise linear embedding of a topological graph in Euclidean 3-space R3 or 3-sphere 3, referred simply a knotted graph, is generated by a set of diagrammatic local moves (see Fig. 1) that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007